منابع مشابه
Additive Automata On Graphs
A bstract. We study cellular automata. with addi tive rules on finite undi rected graphs. The addition is carried out in some finite abelian mono id. We investigate the prob lem of deciding wheth er a given configuration has a predecessor . Depending on th e underlying monoid this prob lem is solvable in polynomial time or NP-complete. Furt hermo re, we st udy the global reversibility of cellul...
متن کاملAdditive AND/OR Graphs
A d d i t i v e AND/OR graphs are de f ined as AND/ /ORgraphs w i t hou t c i r c u i t s , which can be cons idered as fo lded AND/OR t r e e s ; i . e . the cost of a common subproblem is added to the cost as many t imes as the subproblem occurs , but i t is computed on ly once. A d d i t i v e AND/OR graphs are n a t u r a l l y obta ined by r e i n t e r p r e t i n g the dy namic programmi...
متن کاملAdditive Stabilizers for Unstable Graphs
Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with non-empty core. They are also the graphs that induce a network bargaining game with a balanced solution. A graph with weighted edges is called stable if the maximum weight of an integral matching equals the cost of a ...
متن کاملLayout of Compound Directed Graphs
We present a method for the layout of compound directed graphs that is based on the hierarchical layer layout method. Our method has similarities with the method of Sugiyama and Misue 7] but gives diierent results: It uses a global partitioning into layers and tries to produce placements of nodes such that border rectangles can be drawn around the nodes of each subgraph. The method is implement...
متن کاملAdditive Spanners for Circle Graphs and Polygonal Graphs
A graph G = (V, E) is said to admit a system of μ collective additive tree r-spanners if there is a system T (G) of at most μ spanning trees of G such that for any two vertices u, v of G a spanning tree T ∈ T (G) exists such that the distance in T between u and v is at most r plus their distance in G. In this paper, we examine the problem of finding “small” systems of collective additive tree r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00245-8